The Local Bootstrap for Markov processes
نویسندگان
چکیده
A nonparametric bootstrap procedure is proposed for stochastic processes which follow a general autoregressive structure. The procedure generates bootstrap replicates by locally resampling the original set of observations reproducing automatically its dependence properties. It avoids an initial nonparametric estimation of process characteristics in order to generate the pseudo-time series and the bootstrap replicates mimic several of the properties of the original process. Applications of the procedure in nonlinear time series analysis are considered and theoretically justi ed; some simulated and real data examples are discussed. AMS 1990 subject classi cations: Primary 62G09, 62M05; secondary 62M10.
منابع مشابه
Model-Free Bootstrap for Markov processes
Consider time series data X1, . . . , Xn that arise as a (partial) sample path of a stationary Markov process of order p ≥ 1. Under this general context, there are (at least) two resampling mechanisms available in the literature, namely: (a) bootstrap based on kernel estimates of the transition density of the Markov processes of Rajarshi (1990), and the Local Bootstrap for Markov processes of P...
متن کاملBootstrap prediction intervals for Markov processes
Given time series data X1, . . . , Xn, the problem of optimal prediction of Xn+1 has been well-studied. The same is not true, however, as regards the problem of constructing a prediction interval with prespecified coverage probability for Xn+1, i.e., turning the point predictor into an interval predictor. In the past, prediction intervals have mainly been constructed for time series that obey a...
متن کاملBootstrap for continuous - time processes
An Edgeworth expansion of a Studentized statistic for an ergodic regenerative strong Markov process is validated. A specific nonparametric bootstrap method is proposed and proved to be second-order correct in the light of the Edgeworth expansion, which is a variant of the regenerative block bootstrap designed for discrete-time Markov processes. One-dimensional diffusions and semi-Markov process...
متن کاملMatched-block Bootstrap for Long Memory Processes Matched-block Bootstrap for Long Memory Processes
The block bootstrap for time series consists in randomly resampling blocks of consecutive values of the given data and aligning these blocks into a bootstrap sample The matched block bootstrap Carlstein et al samples blocks dependently attempting to follow each block with one that might realistically follow it in the underlying process to better match the dependence structure of the data Blocks...
متن کاملBOOTSTRAP METHODS FOR MARKOV PROCESSES By Joel
The block bootstrap is the best known bootstrap method for time-series data when the analyst does not have a parametric model that reduces the data generation process to simple random sampling. However, the errors made by the block bootstrap converge to zero only slightly faster than those made by first-order asymptotic approximations. This paper describes a bootstrap procedure for data that ar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002